Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
291	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
292	ANYTIME ALGORITHMS FOR ROBDD SYMMETRY DETECTION AND APPROXIMATION a thesis submitted to The University of Kent at Canterbury in the subject of computer science Add to Reading List Source URL: www.digit-labs.org Language: English - Date: 2008-09-04 12:58:00 Analysis of algorithms Symmetry Probabilistic complexity theory Algorithm Approximation algorithm Anytime algorithm Time complexity Randomized algorithm Theoretical computer science Applied mathematics Computational complexity theory
293	Approximate Clustering of Fingerprint Vectors with Missing Values Andres Figueroa† † Avraham Goldstein‡ Andrzej Lingas? Add to Reading List Source URL: crpit.com Language: English - Date: 2012-01-19 01:27:42 Complexity classes NP-complete problems Operations research Mathematical optimization Approximation algorithm NP-complete NP Vertex cover Vector space Theoretical computer science Computational complexity theory Mathematics
294	The Density of Zeros of Forms for which Weak Approximation Fails D.R. Heath-Brown Magdalen College, Oxford Abstract The weak approximation principal fails for the forms x3 + y 3 + z 3 = Add to Reading List Source URL: eprints.maths.ox.ac.uk Language: English - Date: 2009-07-20 09:53:33 Algebraic number theory Modular arithmetic Quadratic reciprocity Quadratic residue Operator theory Meijer G-function Euclidean algorithm Mathematics Number theory Abstract algebra
295	ETNA Electronic Transactions on Numerical Analysis. Volume 35, pp[removed], 2009. Copyright  2009, Kent State University. ISSN[removed]. Add to Reading List Source URL: www.univie.ac.at Language: English - Date: 2009-06-24 17:07:06 Numerical linear algebra Matrix theory Lanczos approximation Lanczos algorithm Positive-definite matrix Conjugate gradient method Matrix exponential Matrix function Factorial Mathematics Algebra Mathematical analysis
296	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:50:59 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics
297	ETNA Electronic Transactions on Numerical Analysis. Volume 35, pp[removed], 2009. Copyright  2009, Kent State University. ISSN[removed]. Add to Reading List Source URL: www.univie.ac.at Language: English - Date: 2009-07-02 05:09:20 Numerical linear algebra Matrix theory Lanczos algorithm Matrix function Monotonic function Galerkin method Lanczos approximation Monotone convergence theorem Mathematical analysis Mathematics Numerical analysis
298	ABRAHAM FLAXMAN, Carnegie Mellon University, Pittsburgh, PA, USA On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem In combinatorial optimization, a po Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:20 Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science Applied mathematics Mathematics
299	Approximation Algorithms for Stochastic Orienteering Anupam Gupta∗ Ravishankar Krishnaswamy† Viswanath Nagarajan‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-09-30 21:07:28 Combinatorial optimization NP-complete problems Operations research Cryptography Knapsack problem Approximation algorithm Linear programming relaxation SL Matching Theoretical computer science Computational complexity theory Applied mathematics
300	Pricing Network Edges to Cross a River Alexander Grigoriev1 , Stan van Hoesel1 , Anton F. van der Kraaij1 , Marc Uetz1 , and Mustapha Bouhtou2 1 Maastricht University, Quantitative Economics, P.O.Box 616, Add to Reading List Source URL: wwwhome.math.utwente.nl Language: English - Date: 2005-01-11 07:55:58 Complexity classes Operations research Network theory NP Shortest path problem Optimization problem Approximation algorithm Strongly NP-complete Flow network Theoretical computer science Computational complexity theory Applied mathematics

UPDATE